Throughput fairness in k-ary n-cube networks

نویسنده

  • Cruz Izu
چکیده

The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered per unit of time. Most synthetic network loads consist of sources injecting at the same given rate, using traffic patterns such as random, permutations or hot spot, which reflect the distribution of packet destinations in many parallel applications. The network is assumed to be fair: all source nodes are able to inject at the same rate. This work will show such assumption is unfounded for most router proposals. All router designs exhibited significant network unfairness under non-uniform loads. Some routers are also unfair under random traffic patterns. At loads above saturation, if the channel utilization is uneven, the injection matrix will become uneven: packet at low used areas will be accepted at a higher rate that those at the busy areas. As synthetic traffic does not reflect the coupled nature of the traffic generated by parallel applications, the impact of this unfairness on application performance could not be measured. New synthetic loads need to be developed to better evaluate network response beyond saturation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analysis of Connectivity of k - ary n - cubem - diag Interconnection Networks

The diierence among diierent topologies in interconnection networks is a debated issue among highly parallel machine designers, since opposing parameters innuence the network performance. This paper presents a new model, k-ary n-cube m-diags, which generalizes existing k-ary n-cube topologies to include hexagonal networks and their n-dimensional extensions. A performance analysis based on this ...

متن کامل

Performance Analysis of K-ary N-cube Interconnection Networks 12

VLSI communication networks are wire limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-...

متن کامل

Performance Analysis of k-Ary n-Cube Interconnection Networks

Abstmct-VLSI communication networks are wire-limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughp...

متن کامل

Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks

Express cubes are k-ary n-cube interconnection networks augmented by express channels that provide a short path for non-local messages. An express cube combines the logarithmic diameter of an indirect network with the wire-efficiency and ability to exploit locality of a direct network. The insertion of express channels reduces the network diameter and thus the distance component of network late...

متن کامل

Impact of Multiple Consumption Channels on Wormhole Routed k-ary n-cube Networks

100 200 0 Throughput Latency do,1 do,2 do,4 pa,1 pa,2 pa,4 (a) do,1 do,2 do,4-6 pa,1 pa,2 pa,4-6

متن کامل

Total-Exchange on Wormhole k-ary n-cubes with Adaptive Routing

The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching. This algorithm is based on an important property of the wormhole...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006